class MyCircularQueue {
    int[] elem;
    int front;
    int rear;

    public MyCircularQueue(int k) {
        elem = new int[k+1];
        front=rear=0;
    }

    public boolean enQueue(int value) {
        if (isFull()){
            return false;
        } else {
            elem[rear]=value;
            rear=(rear+1)%elem.length;
            return true;
        }
    }

    public boolean deQueue() {
        if (isEmpty()){
            return false;
        } else {
            front = (front+1) % elem.length;
            return true;
        }
    }

    public int Front() {
        if (isEmpty()){
            return -1;
        } else {
            return elem[front];
        }
    }

    public int Rear() {
        if (isEmpty()){
            return -1;
        } else {
            int index = (rear == 0) ? elem.length-1 : rear-1;
            return elem[index];
        }
    }

    public boolean isEmpty() {
        return front==rear;
    }

    public boolean isFull() {
        return (rear+1)%elem.length==front;
    }
}


public class Text1 {
}
